Skills evaluation of junior%2Dlevel software talents.

Fuzzy approximate solution of general fully fuzzy linear systems based on GLR%2Dfuzzy numbers.

An Adaptive Staged PSO Based on Particles%27 Search Capabilities.

KNOB Particle Swarm Optimizer.

Particle Swarm Optimization Based Learning Method for Process Neural Networks.

Unusual event detection and prediction based on sectional contextual edit distance.

Unusual event detection and prediction based on sectional contextual edit distance.

Missile Autopilot Design Based on State Dependent Riccati Equation.

Stability analysis of networked control systems A discontiuous Lyapunov functional approach.

Enabling Privacy as a Fundamental Construct for Social Networks.
{maxim, tyroneg, tonysun, drichardson, sxguo,
A Framework for Computing the Privacy Scores of Users in Online Social Networks.
Abstract—A large body of work has been devoted to address corporate-scale privacy concerns related to social networks. The main focus was on how to share social networks owned by organizations without revealing the identities or sensitive relationships of the users involved. Not much attention has been given to the privacy risk of users posed by their informationsharing activities. In this paper, we approach the privacy concerns arising in online social networks from the individual users ’ viewpoint: we propose a framework to compute a privacy score of a user, which indicates the potential privacy risk caused by his participation in the network. Our definition of privacy score satisfies the following intuitive properties: the more sensitive the information revealed by a user, the higher his privacy risk. Also, the more visible the disclosed information becomes in the network, the higher the privacy risk. We develop mathematical models to estimate both sensitivity and visibility of the information. We apply our methods to synthetic and real-world data and demonstrate their efficacy and practical utility. Keywords-privacy score; social network; item response theory I.
Finding a team of experts in social networks.
Given a task T, a pool of individuals X with different skills, and a social network G that captures the compatibility among these individuals, we study the problem of finding X ′ , a subset of X, to perform the task. We call this the Team Formation problem. We require that members of X ′ not only meet the skill requirements of the task, but can also work effectively together as a team. We measure effectiveness using the communication cost incurred by the subgraph in G that only involves X ′. We study two variants of the problem for two different communication-cost functions, and show that both variants are NP-hard. We explore their connections with existing combinatorial problems and give novel algorithms for their solution. To the best of our knowledge, this is the first work to consider the Team Formation problem in the presence of a social network of individuals. Experiments on the DBLP dataset show that our framework works well in practice and gives useful and intuitive results.
Highlighting Diverse Concepts in Documents.
We show the underpinnings of a method for summarizing documents: it ingests a document and automatically highlights a small set of sentences that are expected to cover the different aspects of the document. The sentences are picked using simple coverage and orthogonality criteria. We describe a novel combinatorial formulation that captures exactly the document-summarization problem, and we develop simple and efficient algorithms for solving it. We compare our algorithms with many popular document-summarization techniques via a broad set of experiments on real data. The results demonstrate that our algorithms work well in practice and give high-quality summaries. 1
A note on a minimax rule for portfolio selection and equilibrium price system.

New conditions for delay%2Dderivative%2Ddependent stability.

On the Privacy of Euclidean Distance Preserving Data Perturbation

Magnifier particle swarm optimization for numerical optimization.

Allocation of local and global search capabilities of particle in canonical PSO.

Magnifier particle swarm optimization for numerical optimization.

Towards identity anonymization on graphs.
The proliferation of network data in various application domains has raised privacy concerns for the individuals involved. Recent studies show that simply removing the identities of the nodes before publishing the graph/social network data does not guarantee privacy. The structure of the graph itself, and in its basic form the degree of the nodes, can be revealing the identities of individuals. To address this issue, we study a specific graph-anonymization problem. We call a graph k-degree anonymous if for every node v, there exist at least k−1 other nodes in the graph with the same degree as v. This definition of anonymity prevents the re-identification of individuals by adversaries with a priori knowledge of the degree of certain nodes. We formally define the graph-anonymization problem that, given a graph G, asks for the k-degree anonymous graph that stems from G with the minimum number of graph-modification operations. We devise simple and efficient algorithms for solving this problem. Our algorithms are based on principles related to the realizability of degree sequences. We apply our methods to a large spectrum of synthetic and real datasets and demonstrate their efficiency and practical utility.
Distributed Identification of Top%2Dl Inner Product Elements and its Application in a Peer%2Dto%2DPeer Network.
Abstract — Inner product measures how closely two feature vectors are related. It is an important primitive for many popular data mining tasks, e.g., clustering, classification, correlation computation, and decision tree construction. If the entire data set is available at a single site, then computing the inner product matrix and identifying the top (in terms of magnitude) entries is trivial. However, in many real-world scenarios, data is distributed across many locations and transmitting the data to a central server would be quite communication-intensive and not scalable. This paper presents an approximate local algorithm for identifying top-l inner products among pairs of feature vectors in a large asynchronous distributed environment such as a peer-to-peer (P2P) network. We develop a probabilistic algorithm for this purpose using order statistics and Hoeffding bound. We present experimental results to show the effectiveness and scalability of the algorithm. Finally, we demonstrate an application of this technique for interest-based community formation in a P2P environment. Index Terms — distributed data mining, inner product, peer-topeer network I.
Micro%2DEDM process investigation of Si.

Extensive theoretical study on the low%2Dlying electronic states of silicon monofluoride cation including spin%2Dorbit coupling.

ManyAspects a system for highlighting diverse concepts in documents.

Emergent computation Virtual reality from disordered clapping to ordered clapping.

Emergent computation Virtual reality from disordered clapping to ordered clapping.

Performance of a MANET directional MAC protocol with angle%2Dof%2Darrival estimation.

High Quality Voice Conversion through Phoneme%2DBased Linear Mapping Functions with STRAIGHT for Mandarin.


The PLC System of Egg Powder Treatment Based on Fuzzy Control Algorithm.


Multi%2Dparty
process communication have been examined from a complexity pbint of view [SP, Y]. We study a new model, in which a collection of processes eo, &amp;quot;&#039;&#039;, e~:~l
Performance of Directional MAC Protocols in Ad%2DHoc Networks over Fading Channels.

A Simple and Fast Wavelength Reservation Protocol for Dynamic Traffic in Large Scale Wavelength%2Drouted Networks.


Design and Implementation of a Random Data%2DPlacement System with High Scalability


Network Thinking and Network Intelligence.

Random Projection%2DBased Multiplicative Data Perturbation for Privacy Preserving Distributed Data Mining.
Abstract—This paper explores the possibility of using multiplicative random projection matrices for privacy preserving distributed data mining. It specifically considers the problem of computing statistical aggregates like the inner product matrix, correlation coefficient matrix, and Euclidean distance matrix from distributed privacy sensitive data possibly owned by multiple parties. This class of problems is directly related to many other data-mining problems such as clustering, principal component analysis, and classification. This paper makes primary contributions on two different grounds. First, it explores Independent Component Analysis as a possible tool for breaching privacy in deterministic multiplicative perturbation-based models such as random orthogonal transformation and random rotation. Then, it proposes an approximate random projection-based technique to improve the level of privacy protection while still preserving certain statistical characteristics of the data. The paper presents extensive theoretical analysis and experimental results. Experiments demonstrate that the proposed technique is effective and can be successfully used for different types of privacypreserving data mining applications. Index Terms—Random projection, multiplicative data perturbation, privacy preserving data mining. 1
Clustering distributed data streams in peer%2Dto%2Dpeer environments.

Client%2Dside web mining for community formation in peer%2Dto%2Dpeer environments.
In this paper we present a framework for self-formation of interests-based Peer-to-Peer communities using client-side web browsing history. We propose an order statistics-based algorithm to build communities with hierarchical structures. We also carefully consider the privacy concerns of the peer and adopt cryptographic protocols to measure similarity between peers without disclosing their personal profiles. We have evaluated our algorithm using a distributed data mining toolkit. The experimental results show that our framework could efficiently build interests-based communities.
Constructing Correlations in Attack Connection Chains Using Active Perturbation.

Constructing Correlations of Perturbed Connections Under Packets Loss and Disorder.

Communication Efficient Construction of Decision Trees Over Heterogeneously Distributed Data.
We present an algorithm designed to efficiently construct a decision tree over heterogeneously distributed data without centralizing. We compare our algorithm against a standard centralized decision tree implementation in terms of accuracy as well as the communication complexity. Our experimental results show that by using only 20 % of the communication cost necessary to centralize the data we can achieve trees with accuracy at least 80 % of the trees produced by the centralized version.
VEDAS A Mobile and Distributed Data Stream Mining System for Real%2DTime Vehicle Monitoring.

Privacy Sensitive Distributed Data Mining from Multi%2Dparty Data.

